Non-monotonic reasoning with normative conflicts in multi-agent deontic logic

Non-monotonic reasoning with normative conflicts in multi-agent deontic logic

We present proof-theoretical and semantical characterizations of two multi-agent deontic logics for dealing with normative conflicts. The resulting logics PMDL and PMDL are non-standard in at least two respects. First, they are nonclassical in the sense that they invalidate some inferences of the propositional fragment of Classical Logic (CL). Consequently, they also invalidate certain inferenc...

Normative Conflicts and Deontic Logic

Specifying and reasoning about normative systems in deontic logic programming

In this paper we propose the usage of a framework combining standard deontic logic (SDL) and non-monotonic logic programming – deontic logic programs (DLP) – to represent and reason about normative systems.

Non-Monotonic Reasoning with Logic Programming

Our purpose is to exhibit a modular systematic method of representing non{ monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning probl...

NoMoRe : Non-monotonic Reasoning with Logic Programs

The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflec...